Finding generalized projected clusters in high dimensional spaces
نویسندگان
چکیده
منابع مشابه
Generalized Projected Clustering in High-Dimensional Data Streams
Clustering is to identify densely populated subgroups in data, while correlation analysis is to find the dependency between the attributes of the data set. In this paper, we combine the two techniques in the domain of data streams, i.e. dense subgroup of data points sharing strong correlation. Such correlation connected cluster [11] is meaningful in many areas, e.g., in E-business, the positive...
متن کاملCommutative curvature operators over four-dimensional generalized symmetric spaces
Commutative properties of four-dimensional generalized symmetric pseudo-Riemannian manifolds were considered. Specially, in this paper, we studied Skew-Tsankov and Jacobi-Tsankov conditions in 4-dimensional pseudo-Riemannian generalized symmetric manifolds.
متن کاملPCFA: mining of projected clusters in high dimensional data using modified FCM algorithm
Data deals with the specific problem of partitioning a group of objects into a fixed number of subsets, so that the similarity of the objects in each subset is increased and the similarity across subsets is reduced. Several algorithms have been proposed in the literature for clustering, where k-means clustering and Fuzzy C-Means (FCM) clustering are the two popular algorithms for partitioning t...
متن کاملD Partition Algorithms – A Study and Emergence of Mining Projected Clusters in High - Dimensional Dataset
High-dimensional data has a major challenge due to the inherent sparsity of the points. Existing clustering algorithms are inefficient to the required similarity measure is computed between data points in the full-dimensional space. In this work, a number of projected clustering algorithms have been analyzed. However, most of them encounter difficulties when clusters hide in subspaces with very...
متن کاملAudio Key Finding Using Low-Dimensional Spaces
This paper presents two models of audio key finding: a template based correlational model and a template based model that uses a low-dimensional tonal representation. The first model uses a confidence weighted correlation to find the most probable key. The second model is distance based and employs dimensionality reduction to the tonal representation before generating a key estimate. Experiment...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMOD Record
سال: 2000
ISSN: 0163-5808
DOI: 10.1145/335191.335383